package com.da.javatest.leetCode;

/**
 * @author chenlida
 * @date 2019/1/5 11:51
 * @description
 */
public class Code789 {
    public boolean escapeGhosts(int[][] ghosts, int[] target) {
        int length = Math.abs(target[0]) + Math.abs(target[1]);
        for (int i = 0; i < ghosts.length; i++) {
            if (Math.abs(target[0] - ghosts[i][0]) + Math.abs(target[1] - ghosts[i][1]) <= length) { return false; }
        }
        return true;
    }
}
